Some Remarkable Properties of H-graphs

نویسنده

  • Jianan Lu
چکیده

It is proved that if H (u) is non-decreasing and if H (?1) 6 = H (+1), then if u(x) describes a graph over a disk B R (0), with (upward oriented) mean curvature H (u), there is a bound on the gradient jD u(0)j that depends only on R, on u(0), and on the particular function H (u). As a consequence a form of Harnack's inequality is obtained, in which no positivity hypothesis appears. The results are qualitatively best possible, in the senses that a) they are false if H is constant, and b) the dependences indicated are essential (If H (?1) = ?1; H (+1) = 1, then the dependence on u(0) can be deleted). The demonstrations are based on an existence theorem for a nonlinear boundary problem with singular data, which is of independent interest. reziume. vTqvaT, H (u) arakl ebad ia da H (?1) 6 = H (+1). damt-kicebu l ia, rom Tu u(x) aGCers B R (0) Creze gansazGvr u l i Punqciis graP iks (zeviT mimar Tul i) H (u) saSu al o simru d iT, maSin arsebobs jDu(0)j grad ient is SePaseba, romel ic damokidebu l ia mxol od R-ze, u(0)-ze da H (u) Punqciaze. Sedegis saxiT miGebu l ia Harnakis utol obis erTi nairsaxeoba, romelSic ar Pigu rir ebs dadebiTobis piroba. Sedegebi Tvisebrivad gauumJ obesebad ia im azriT, rom a) isini araa samar Tl iani, Tu H mud mivia, da b) zemoT miT iTebul i damokide-bul ebebi arsebiTia In this note, we summarize and improve in some detail the material of 1]. We consider the equation div T u = 2H(u); T u = 1 q 1 + u 2 x + u 2 y hu x ; u y i (1) whose solutions are graphs u(x; y) of mean curvature H(u). Since (1) is of elliptic type, the qualitative behavior of its solutions may be expected to emulate what happens for the Laplace equation u = 0, which is usually taken

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A note on vague graphs

In this paper, we introduce the notions of product vague graph, balanced product vague graph, irregularity and total irregularity of any irregular vague graphs and some results are presented. Also, density and balanced irregular vague graphs are discussed and some of their properties are established. Finally we give an application of vague digraphs.

متن کامل

Remarks on Distance-Balanced Graphs

Distance-balanced graphs are introduced as graphs in which every edge uv has the following property: the number of vertices closer to u than to v is equal to the number of vertices closer to v than to u. Basic properties of these graphs are obtained. In this paper, we study the conditions under which some graph operations produce a distance-balanced graph.

متن کامل

THE ORDER GRAPHS OF GROUPS

Let $G$ be a group. The order graph of $G$ is the (undirected)graph $Gamma(G)$,those whose vertices are non-trivial subgroups of $G$ and two distinctvertices $H$ and $K$ are adjacent if and only if either$o(H)|o(K)$ or $o(K)|o(H)$. In this paper, we investigate theinterplay between the group-theoretic properties of $G$ and thegraph-theoretic properties of $Gamma(G)$. For a finite group$G$, we s...

متن کامل

An Alexandroff topology on graphs

Let G = (V,E) be a locally finite graph, i.e. a graph in which every vertex has finitely many adjacent vertices. In this paper, we associate a topology to G, called graphic topology of G and we show that it is an Alexandroff topology, i.e. a topology in which intersec- tion of every family of open sets is open. Then we investigate some properties of this topology. Our motivation is to give an e...

متن کامل

Some results on Bipolar Fuzzy Graph

In this paper, the notion ofgraph operationsdisjunction and symmetric difference on bipolar fuzzy graphs are defined and it is proved that the new graph is a bipolar graph. Furthermore,the new concepts of bipolar fuzzy graphs calledupperstrong and lower strongbipolar fuzzy graphare introduced and some related </...

متن کامل

Some Algebraic and Combinatorial Properties of the Complete $T$-Partite Graphs

In this paper, we characterize the shellable complete $t$-partite graphs. We also show for these types of graphs the concepts vertex decomposable, shellable and sequentially Cohen-Macaulay are equivalent. Furthermore, we give a combinatorial condition for the Cohen-Macaulay complete $t$-partite graphs.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997